Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) A New Generic Scheme for Functional Logic Programming with Constraints Francisco J. L´opez Fraguas · Mario Rodr´ıguez

Source URL: gpd.sip.ucm.es

Semantics for core Concurrent ML using computation types Alan Jeffrey Abstract This paper presents two typed higher-order concurrent functional programming languages, based on Reppy’s Concurrent ML. The first is a simp

Source URL: ect.bell-labs.com

• Theoretical computer science
• Logic in computer science
• Software engineering
• Formal methods
• Programming language semantics
• Models of computation
• Operational semantics
• Semantics
• Bisimulation
• Process calculus
• Programming language
• Transition system

Inductive Fixpoints in Higher Order Logic Sava Krsti´c OGI School of Science and Engineering Oregon Health and Sciences University Abstract

Source URL: www.csee.ogi.edu

Temporal Higher-Order Contracts Tim Disney Cormac Flanagan Jay McCarthy

Source URL: jeapostrophe.github.io

• Lambda calculus
• Combinatory logic
• Logic in computer science
• Computability theory
• Functions and mappings
• Formal methods
• Monad
• Derivative
• Trace

A fully abstract semantics for a higher-order functional language with nondeterministic computation A LAN J EFFREY A BSTRACT. This paper is about the relationship between the theory of monadic types and the practice of c

Source URL: ect.bell-labs.com

• Category theory
• Models of computation
• Adjoint functors
• Functional programming
• Logic in computer science
• Denotational semantics
• Lambda calculus
• Cartesian closed category
• Sheaf
• F-algebra
• Kleisli category
• Monad

BRICS Basic Research in Computer Science BRICS DS-01-4 M. Rhiger: Higher-Order Program Generation

Source URL: www.brics.dk

• Functional languages
• Type theory
• Data types
• Lambda calculus
• Logic in computer science
• Type system
• ML
• OCaml
• Partial evaluation
• Software engineering
• Programming language theory
• Computing

Abstract syntax for variable binders: An overview Dale Miller Department of Computer Science and Engineering 220 Pond Laboratory, The Pennsylvania State University University Park, PAUSA

Source URL: www.lix.polytechnique.fr

• Lambda calculus
• Logic programming
• Type theory
• Predicate logic
• ΛProlog
• Unification
• Free variables and bound variables
• Simply typed lambda calculus
• Higher-order abstract syntax
• Logic
• Mathematics
• Theoretical computer science

Geometric and Higher Order Logic in terms of Abstract Stone Duality Paul Taylor Abstract The contravariant powerset and its generalisations ΣX to the lattices of open subsets of a locally compact topological space and o

Source URL: www.paultaylor.eu

Balancing lists: a proof pearl? Guyslain Naves1 and Arnaud Spiwack2 1 Aix Marseille Université, CNRS, LIF UMR 7279, 13288, Marseille, France

Source URL: assert-false.net

• Recursion
• Higher-order functions
• Functional languages
• Mathematical logic
• Computability theory
• Binary tree
• Map
• Tree
• Binary search tree
• Computer programming
• Computing
• Software engineering

Twelf Carsten Sch¨ urmann ∗ Department of Computer Science Yale University

Source URL: www.itu.dk

• Type theory
• Logic in computer science
• Dependently typed programming
• Formal methods
• Lambda calculus
• Twelf
• Higher-order abstract syntax
• Logical framework
• Frank Pfenning
• Theoretical computer science
• Mathematics
• Programming language theory